- trivial branch
- Макаров: тривиальная ветвь (напр. решения)
Универсальный англо-русский словарь. Академик.ру. 2011.
trivial branch
Смотреть что такое "trivial branch" в других словарях:
Branch predictor — In computer architecture, a branch predictor is the part of a processor that determines whether a conditional branch in the instruction flow of a program is likely to be taken or not. This is called branch prediction. Branch predictors are… … Wikipedia
Branch and bound — Séparation et évaluation Un algorithme par séparation et évaluation, également appelé selon le terme anglo saxon branch and bound, est une méthode générique de résolution de problèmes d optimisation, et plus particulièrement d optimisation… … Wikipédia en Français
Hall Green Branch — The Hall Green Branch of the Trent and Mersey Canal is a canal in east Cheshire, England. It runs for one mile from Kidsgrove to Hall Green, where it makes an end on junction with the Macclesfield Canal at a stop lock.Whilst originally built by… … Wikipedia
science, philosophy of — Branch of philosophy that attempts to elucidate the nature of scientific inquiry observational procedures, patterns of argument, methods of representation and calculation, metaphysical presuppositions and evaluate the grounds of their validity… … Universalium
Novel — For other uses, see Novel (disambiguation). Not to be confused with Novell. New novels in a Oldenburg bookshop, February 2009 … Wikipedia
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
literature — /lit euhr euh cheuhr, choor , li treuh /, n. 1. writings in which expression and form, in connection with ideas of permanent and universal interest, are characteristic or essential features, as poetry, novels, history, biography, and essays. 2.… … Universalium
Dynkin diagram — See also: Coxeter–Dynkin diagram Finite Dynkin diagrams Affine (extended) Dynkin diagrams … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
computer — computerlike, adj. /keuhm pyooh teuhr/, n. 1. Also called processor. an electronic device designed to accept data, perform prescribed mathematical and logical operations at high speed, and display the results of these operations. Cf. analog… … Universalium
Ring (mathematics) — This article is about algebraic structures. For geometric rings, see Annulus (mathematics). For the set theory concept, see Ring of sets. Polynomials, represented here by curves, form a ring under addition and multiplication. In mathematics, a… … Wikipedia
